Method and apparatus for improved entropy encoding and decoding

ABSTRACT

Methods and apparatus are provided for improved entropy encoding and decoding. An apparatus includes a video encoder for encoding at least a block in a picture by transforming a residue of the block to obtain transform coefficients, quantizing the transform coefficients to obtain quantized transform coefficients, and entropy coding the quantized transform coefficients. The quantized transform coefficients are encoded using a flag to indicate that a current one of the quantized transform coefficients being processed is a last non-zero coefficient for the block having a value greater than or equal to a specified value.

CROSS-REFERENCE TO RELATED APPLICATIONS

This application claims the benefit of U.S. Provisional Application Ser.No. 61/393,195, filed Oct. 14, 2010, which is incorporated by referenceherein in its entirety.

TECHNICAL FIELD

The present principles relate generally to video encoding and decodingand, more particularly, to methods and apparatus for improved entropyencoding and decoding.

BACKGROUND

Video coding standards employ prediction and block-based transforms toleverage redundancy in intra/inter frame correlation and achieve highcompression efficiency. Furthermore, entropy coding makes the codedbit-stream achieve its entropy boundary and further improves the codingefficiency.

An important usage of entropy coding in video coding system is thecoding of the quantized transform coefficients of a block, which is theresidual data block after intra/inter prediction, block transform, andquantization. For such data, entropy coding tools have been developed,ranging from variable length coding, such as the Huffman coding, toarithmetic coding. The state-of-the-art CABAC (context-adaptive binaryarithmetic coding) achieves high coding efficiency, but thenon-systematic implementation of the CABAC coding procedure results intwo scanning passes being performed to code a data block.

CABAC is the entropy coding method for the quantized transformcoefficient block in the International Organization forStandardization/International Electrotechnical Commission (ISO/IEC)Moving Picture Experts Group-4 (MPEG-4) Part 10 Advanced Video Coding(AVC) Standard/International Telecommunication Union, TelecommunicationSector (ITU-T) H.264 Recommendation (hereinafter the “MPEG-4 AVCStandard”). CABAC codes a block in two main passes. In the first pass,CABAC codes the significance map of the block according to a forwardzigzag scanning order. In the second pass, CABAC codes the non-zerovalues in an inverse zigzag scanning order.

Turning to FIG. 1, an example of CABAC coding is indicated generally bythe reference numeral 100. In the significance map coding pass, i.e.,the first pass, CABAC uses the sig_flag and last_flag to indicate thepositions of the non-zero coefficients.

In the inverse zigzag coding of the non-zero values, two sub-codingprocesses are used. In the first sub-coding process, a syntax calledBin_(—)1 (i.e., the first bin) is used to indicate whether or not anon-zero coefficient has an absolute value of one. If the non-zerocoefficient has an absolute value of one, then Bin 1=1 and the sign ofthe non-zero coefficient is sent out. Otherwise, Bin_(—)1=0 and theencoding moves to the second sub-coding process. In the secondsub-coding process, CABAC codes the coefficients which have an absolutevalue greater than one, corresponding to Bin_(—)1=0, and then sends outtheir respective signs.

The disadvantage of CABAC is that the corresponding coding involves twoscanning passes (i.e., a forward zigzag scan to code the significancemap, and an inverse zigzag scan to code values). In addition, the designof CABAC is mainly for smaller block sizes (e.g., 4×4 and 8×8). CABACturns out to be less efficient for larger blocks (e.g., 16×16, 32×32,and 64×64).

One prior art approach proposes adding a flag to signal the lastposition of a discrete cosine transform (DCT) coefficient greater thanone. However, the prior art approach is restricted to a flag greaterthan one and still uses two scanning passes.

SUMMARY

These and other drawbacks and disadvantages of the prior art areaddressed by the present principles, which are directed to methods andapparatus for improved entropy encoding and decoding.

According to an aspect of the present principles, there is provided anapparatus. The apparatus includes a video encoder for encoding at leasta block in a picture by transforming a residue of the block to obtaintransform coefficients, quantizing the transform coefficients to obtainquantized transform coefficients, and entropy coding the quantizedtransform coefficients. The quantized transform coefficients are encodedusing a flag to indicate that a current one of the quantized transformcoefficients being processed is a last non-zero coefficient for theblock having a value greater than or equal to a specified value.

According to another aspect of the present principles, there is provideda method in a video encoder. The method includes encoding at least ablock in a picture by transforming a residue of the block to obtaintransform coefficients, quantizing the transform coefficients to obtainquantized transform coefficients, and entropy coding the quantizedtransform coefficients. The quantized transform coefficients are encodedusing a flag to indicate that a current one of the quantized transformcoefficients being processed is a last non-zero coefficient for theblock having a value greater than or equal to a specified value.

According to yet another aspect of the present principles, there isprovided an apparatus. The apparatus includes a video decoder fordecoding at least a block in a picture by entropy decoding quantizedtransform coefficients, de-quantizing the quantized transformcoefficients to obtain transform coefficients, and inverse transformingthe transform coefficients to obtain a reconstructed residue of theblock for use in reconstructing the block. The quantized transformcoefficients are decoded using a flag to indicate that a current one ofthe quantized transform coefficients being processed is a last non-zerocoefficient for the block having a value greater than or equal to aspecified value.

According to still another aspect of the present principles, there isprovided a method in a video decoder. The method includes decoding atleast a block in a picture by entropy decoding quantized transformcoefficients, de-quantizing the quantized transform coefficients toobtain transform coefficients, and inverse transforming the transformcoefficients to obtain a reconstructed residue of the block for use inreconstructing the block. The quantized transform coefficients aredecoded using a flag to indicate that a current one of the quantizedtransform coefficients being processed is a last non-zero coefficientfor the block having a value greater than or equal to a specified value.

These and other aspects, features and advantages of the presentprinciples will become apparent from the following detailed descriptionof exemplary embodiments, which is to be read in connection with theaccompanying drawings.

BRIEF DESCRIPTION OF THE DRAWINGS

The present principles may be better understood in accordance with thefollowing exemplary figures, in which:

FIG. 1 is a diagram showing an example of CABAC coding, in accordancewith the prior art;

FIG. 2 is a block diagram showing an exemplary video encoder to whichthe present principles may be applied, in accordance with an embodimentof the present principles;

FIG. 3 is a block diagram showing an exemplary video decoder to whichthe present principles may be applied, in accordance with an embodimentof the present principles;

FIG. 4 is a diagram showing an exemplary quantized transform block ofsize 4×4, in accordance with an embodiment of the present principles;

FIG. 5 is a diagram showing an example of a coding process, inaccordance with an embodiment of the present principles;

FIG. 6 is a diagram showing exemplary special cases where Bin_(—)1 isnot saved, in accordance with an embodiment of the present principles;

FIG. 7A is a flow diagram showing an exemplary method for entropyencoding, in accordance with an embodiment of the present principles;

FIG. 7B is a flow diagram showing an exemplary method for encodinglast_ge2_flag, in accordance with an embodiment of the presentprinciples;

FIG. 7C is a flow diagram showing an exemplary method for encodinglast_flag, in accordance with an embodiment of the present principles;

FIG. 7D is a flow diagram showing an exemplary method for encodingBin_(—)1, in accordance with an embodiment of the present principles;

FIG. 7E is a flow diagram showing an exemplary method for encodinglevel, in accordance with an embodiment of the present principles;

FIG. 8A is a flow diagram showing an exemplary method for entropydecoding, in accordance with an embodiment of the present principles;

FIG. 8B is a flow diagram showing an exemplary method for decodinglast_ge2_flag, in accordance with an embodiment of the presentprinciples;

FIG. 8C is a flow diagram showing an exemplary method for decodinglast_flag, in accordance with an embodiment of the present principles;

FIG. 8D is a flow diagram showing an exemplary method for decodingBin_(—)1, in accordance with an embodiment of the present principles;

FIG. 8E is a flow diagram showing an exemplary method for decodinglevel, in accordance with an embodiment of the present principles;

FIG. 9 is a flow diagram showing a method for selecting and signaling avalue for a current transform coefficient, in accordance with anembodiment of the present principles; and

FIG. 10 is a flow diagram showing an exemplary method for decoding avalue for a current transform coefficient, in accordance with anembodiment of the present principles.

DETAILED DESCRIPTION

The present principles are directed to methods and apparatus forimproved entropy encoding and decoding.

The present description illustrates the present principles. It will thusbe appreciated that those skilled in the art will be able to devisevarious arrangements that, although not explicitly described or shownherein, embody the present principles and are included within its spiritand scope.

All examples and conditional language recited herein are intended forpedagogical purposes to aid the reader in understanding the presentprinciples and the concepts contributed by the inventor(s) to furtheringthe art, and are to be construed as being without limitation to suchspecifically recited examples and conditions.

Moreover, all statements herein reciting principles, aspects, andembodiments of the present principles, as well as specific examplesthereof, are intended to encompass both structural and functionalequivalents thereof. Additionally, it is intended that such equivalentsinclude both currently known equivalents as well as equivalentsdeveloped in the future, i.e., any elements developed that perform thesame function, regardless of structure.

Thus, for example, it will be appreciated by those skilled in the artthat the block diagrams presented herein represent conceptual views ofillustrative circuitry embodying the present principles. Similarly, itwill be appreciated that any flow charts, flow diagrams, statetransition diagrams, pseudocode, and the like represent variousprocesses which may be substantially represented in computer readablemedia and so executed by a computer or processor, whether or not suchcomputer or processor is explicitly shown.

The functions of the various elements shown in the figures may beprovided through the use of dedicated hardware as well as hardwarecapable of executing software in association with appropriate software.When provided by a processor, the functions may be provided by a singlededicated processor, by a single shared processor, or by a plurality ofindividual processors, some of which may be shared. Moreover, explicituse of the term “processor” or “controller” should not be construed torefer exclusively to hardware capable of executing software, and mayimplicitly include, without limitation, digital signal processor (“DSP”)hardware, read-only memory (“ROM”) for storing software, random accessmemory (“RAM”), and non-volatile storage.

Other hardware, conventional and/or custom, may also be included.Similarly, any switches shown in the figures are conceptual only. Theirfunction may be carried out through the operation of program logic,through dedicated logic, through the interaction of program control anddedicated logic, or even manually, the particular technique beingselectable by the implementer as more specifically understood from thecontext.

In the claims hereof, any element expressed as a means for performing aspecified function is intended to encompass any way of performing thatfunction including, for example, a) a combination of circuit elementsthat performs that function or b) software in any form, including,therefore, firmware, microcode or the like, combined with appropriatecircuitry for executing that software to perform the function. Thepresent principles as defined by such claims reside in the fact that thefunctionalities provided by the various recited means are combined andbrought together in the manner which the claims call for. It is thusregarded that any means that can provide those functionalities areequivalent to those shown herein.

Reference in the specification to “one embodiment” or “an embodiment” ofthe present principles, as well as other variations thereof, means thata particular feature, structure, characteristic, and so forth describedin connection with the embodiment is included in at least one embodimentof the present principles. Thus, the appearances of the phrase “in oneembodiment” or “in an embodiment”, as well any other variations,appearing in various places throughout the specification are notnecessarily all referring to the same embodiment.

It is to be appreciated that the use of any of the following “/”,“and/or”, and “at least one of”, for example, in the cases of “A/B”, “Aand/or B” and “at least one of A and B”, is intended to encompass theselection of the first listed option (A) only, or the selection of thesecond listed option (B) only, or the selection of both options (A andB). As a further example, in the cases of “A, B, and/or C” and “at leastone of A, B, and C”, such phrasing is intended to encompass theselection of the first listed option (A) only, or the selection of thesecond listed option (B) only, or the selection of the third listedoption (C) only, or the selection of the first and the second listedoptions (A and B) only, or the selection of the first and third listedoptions (A and C) only, or the selection of the second and third listedoptions (B and C) only, or the selection of all three options (A and Band C). This may be extended, as readily apparent by one of ordinaryskill in this and related arts, for as many items listed.

Also, as used herein, the words “picture” and “image” are usedinterchangeably and refer to a still image or a picture from a videosequence. As is known, a picture may be a frame or a field.

Turning to FIG. 2, an exemplary video encoder to which the presentprinciples may be applied is indicated generally by the referencenumeral 200. The video encoder 200 includes a frame ordering buffer 210having an output in signal communication with a non-inverting input of acombiner 285. An output of the combiner 285 is connected in signalcommunication with a first input of a transformer and quantizer 225. Anoutput of the transformer and quantizer 225 is connected in signalcommunication with a first input of an entropy coder 245 and a firstinput of an inverse transformer and inverse quantizer 250. An output ofthe entropy coder 245 is connected in signal communication with a firstnon-inverting input of a combiner 290. An output of the combiner 290 isconnected in signal communication with a first input of an output buffer235.

A first output of an encoder controller 205 is connected in signalcommunication with a second input of the frame ordering buffer 210, asecond input of the inverse transformer and inverse quantizer 250, aninput of a picture-type decision module 215, a first input of amacroblock-type (MB-type) decision module 220, a second input of anintra prediction module 260, a second input of a deblocking filter 265,a first input of a motion compensator 270, a first input of a motionestimator 275, and a second input of a reference picture buffer 280.

A second output of the encoder controller 205 is connected in signalcommunication with a first input of a Supplemental EnhancementInformation (SEI) inserter 230, a second input of the transformer andquantizer 225, a second input of the entropy coder 245, a second inputof the output buffer 235, and an input of the Sequence Parameter Set(SPS) and Picture Parameter Set (PPS) inserter 240.

An output of the SEI inserter 230 is connected in signal communicationwith a second non-inverting input of the combiner 290.

A first output of the picture-type decision module 215 is connected insignal communication with a third input of the frame ordering buffer210. A second output of the picture-type decision module 215 isconnected in signal communication with a second input of amacroblock-type decision module 220.

An output of the Sequence Parameter Set (SPS) and Picture Parameter Set(PPS) inserter 240 is connected in signal communication with a thirdnon-inverting input of the combiner 290.

An output of the inverse quantizer and inverse transformer 250 isconnected in signal communication with a first non-inverting input of acombiner 219. An output of the combiner 219 is connected in signalcommunication with a first input of the intra prediction module 260 anda first input of the deblocking filter 265. An output of the deblockingfilter 265 is connected in signal communication with a first input of areference picture buffer 280. An output of the reference picture buffer180 is connected in signal communication with a second input of themotion estimator 275 and a third input of the motion compensator 270. Afirst output of the motion estimator 275 is connected in signalcommunication with a second input of the motion compensator 270. Asecond output of the motion estimator 275 is connected in signalcommunication with a third input of the entropy coder 245.

An output of the motion compensator 270 is connected in signalcommunication with a first input of a switch 297. An output of the intraprediction module 260 is connected in signal communication with a secondinput of the switch 297. An output of the macroblock-type decisionmodule 220 is connected in signal communication with a third input ofthe switch 297. The third input of the switch 297 determines whether ornot the “data” input of the switch (as compared to the control input,i.e., the third input) is to be provided by the motion compensator 270or the intra prediction module 260. The output of the switch 297 isconnected in signal communication with a second non-inverting input ofthe combiner 219 and an inverting input of the combiner 285.

A first input of the frame ordering buffer 210 and an input of theencoder controller 205 are available as inputs of the encoder 200, forreceiving an input picture. Moreover, a second input of the SupplementalEnhancement Information (SEI) inserter 230 is available as an input ofthe encoder 200, for receiving metadata. An output of the output buffer235 is available as an output of the encoder 200, for outputting abitstream.

Turning to FIG. 3, an exemplary video decoder to which the presentprinciples may be applied is indicated generally by the referencenumeral 300. The video decoder 300 includes an input buffer 310 havingan output connected in signal communication with a first input of anentropy decoder 345. A first output of the entropy decoder 345 isconnected in signal communication with a first input of an inversetransformer and inverse quantizer 350. An output of the inversetransformer and inverse quantizer 350 is connected in signalcommunication with a second non-inverting input of a combiner 325. Anoutput of the combiner 325 is connected in signal communication with asecond input of a deblocking filter 365 and a first input of an intraprediction module 360. A second output of the deblocking filter 365 isconnected in signal communication with a first input of a referencepicture buffer 380. An output of the reference picture buffer 380 isconnected in signal communication with a second input of a motioncompensator 370.

A second output of the entropy decoder 345 is connected in signalcommunication with a third input of the motion compensator 370, a firstinput of the deblocking filter 365, and a third input of the intrapredictor 360. A third output of the entropy decoder 345 is connected insignal communication with an input of a decoder controller 305. A firstoutput of the decoder controller 305 is connected in signalcommunication with a second input of the entropy decoder 345. A secondoutput of the decoder controller 305 is connected in signalcommunication with a second input of the inverse transformer and inversequantizer 350. A third output of the decoder controller 305 is connectedin signal communication with a third input of the deblocking filter 365.A fourth output of the decoder controller 305 is connected in signalcommunication with a second input of the intra prediction module 360, afirst input of the motion compensator 370, and a second input of thereference picture buffer 380.

An output of the motion compensator 370 is connected in signalcommunication with a first input of a switch 397. An output of the intraprediction module 360 is connected in signal communication with a secondinput of the switch 397. An output of the switch 397 is connected insignal communication with a first non-inverting input of the combiner325.

An input of the input buffer 310 is available as an input of the decoder300, for receiving an input bitstream. A first output of the deblockingfilter 365 is available as an output of the decoder 300, for outputtingan output picture.

As noted above, the present principles are directed to methods andapparatus for improved video encoding and decoding. Advantageously, thepresent principles overcome the non-systematic weakness of CABAC. Thepresent principles also use a binary arithmetic coding engine, but witha systematic coding procedure that saves binary bins, which reduces theuse of the binary arithmetic coding engine in both the encoder and thedecoder. With this systematic coding method and the reduced binary bins,a simpler coding system and higher compression efficiency is achievedover prior art CABAC systems.

Thus, the present principles are directed to the systematic entropycoding of coefficient blocks with less syntax bins. Systematically, wecode the coefficient value when the coefficient value is found (orprocessed) in a given scanning order. Specifically, we use a“significance flag” (sig_flag) to indicate the zero and non-zerocoefficients. For non-zero, we use the “last coefficient greater orequal to 2” (last_ge2_flag) and “last flag” (last_flag) to indicatewhether or not the left set of positions includes a number of non-zerocoefficients “greater or equal to 2” (ge2) and significant coefficients,respectively. Whenever a significant coefficient is found or indicatedby the sig_flag (sig_flag=1), its value is coded immediately. There areat least three benefits to the approach of the present principles:

-   -   (1) The whole block is coded in one scan, which makes the system        simpler.    -   (2) Binary bins are reduced and thus some binary arithmetic        coding operations are saved at the encoder and the decoder.    -   (3) Level information of neighboring coded coefficients is        available to design the context models for the syntax such as        sig_flag, last_flag, last_ge2_flag, and the level bins.

Thus, the entropy coding system disclosed and described is a simpler andmore efficient entropy coding system than prior art systems.

In a video coding system, the raw data is processed with intra or interprediction to remove intra or inter frame correlation, and thenprocessed with a block-based transform such as the 4×4, 8×8, 16×16,32×32, and 64×64 DCT (or some other transform) to further remove thecorrelation. Then quantization is applied to the coefficients in thetransform blocks. In an embodiment, entropy coding is performed last tocode the quantized coefficients of each transformed block in order toprovide the same for the output bitstream.

Turning to FIG. 4, an exemplary quantized transform block of size 4×4 isindicated generally by the reference numeral 400. After prediction,transformation, and quantization, most of the energy of a block isconcentrated in the low frequency positions (which lie in the top-leftcorner of a transform block) while most of the high frequencycoefficients (which lie in the bottom-right corner of the block) arezeros. To entropy code such a data block, we need to express the blockinformation including the coefficient values and their positions insidethe block efficiently with binary bins. Then, the binary bins are codedwith a binary arithmetic coding engine.

To express the block information with binary bins, we use the followingsyntaxes. For purposes of ease of description, some of syntax elementsare borrowed from existing methods, such as CABAC. Additionally, newsyntax elements are introduced to enable the present principles asfollows:

-   -   Sig_flag: It is defined the same as in CABAC. Sig_flag=1 means a        corresponding coefficient is non-zero (significant). Sig_flag=0        means a corresponding coefficient is zero.    -   Last_ge2_flag: It is a new syntax element introduced in        accordance with the present principles for indicating whether or        not the current non-zero coefficient is the last coefficient        with an absolute value larger than one in the current block by        the given scanning order. The expression “get” comes from        “Greater or Equal to 2”. Last_ge2_flag=1 means the current        non-zero coefficient is the last such coefficient.        Last_ge2_flag=0 means the current non-zero coefficient is not        the last such coefficient.    -   Last_flag: It is defined the same as in CABAC. Last_flag means        whether or not the current non-zero coefficient is the last one        in the current block in the given scanning order. Last_flag=1        means the current non-zero coefficient is the last such one.        Last_flag=0 means the current non-zero coefficient is not the        last such one.    -   Bin_(—)1: When a coefficient is known to be non-zero, but not        known to be one or larger than one (ge2) in terms of its        absolute value, a bin_(—)1 is sent out to clarify it. Bin_(—)1=1        means the non-zero coefficient has an absolute value of one.        Bin_(—)1=0 means the non-zero coefficient has an absolute value        greater than one (ge2). Note that we use Bin_(—)1 to indicate        that a coefficient has an absolute value of one or larger than        one, instead of coding this information as other coefficient        values, such as 2, 3, or larger. This is because in a typical        data block, about half of the non-zeros have an absolute value        of one, so it is more efficient to process them specially.    -   Level: When a coefficient is known to have an absolute value        larger than one (ge2), we send out its level which is the        absolute value. Originally, this level is not binary, so we use        some binarization method such as, for example, but not limited        to, the UEGO method used in CABAC to binarize them and then we        code these binary bins with binary arithmetic coding.    -   Sign: For every non-zero coefficient, the sign is sent out as 0        or 1 for “+” and “−”, respectively.

Turning to FIG. 5, an example of a coding process is indicated generallyby the reference numeral 500. The coding process 500 is described withrespect to the coding of the example block 400 in FIG. 4. We scan thedata in a given scanning order, for example, the forward zigzag scan inCABAC. The rearranged coefficients are given in the first row of FIG. 5.

-   -   For the first coefficient “10”, it is non-zero (sig_flag=1) and        not the last ge2 (last_ge2_flag=0). To code its value, first        send out Bin_(—)=0 to indicate its absolute value is greater        than one. Then code its absolute value with level. Here only        code 10-2=8, and the decoder knows that the absolute value        should be 8+2=10. Finally, send out its sign “+” with 0.    -   For the second coefficient “0”, sig_flag=0. Then all information        about this coefficient has been sent out, and the encoder moves        to process the next coefficient.    -   The next coefficient “4”, it is non-zero (sig_flag=1) and not        the last ge2 (last_ge2_flag=0). To code its value, send out        Bin_=1 to indicate its absolute value is one, and then there is        no need to process level. Finally, send out its sign “−” with 1.    -   The next coefficient “2”, it is non-zero (sig_flag=1) and is the        last ge2 (last_ge2_flag=1). After last_ge2_flag=1, we need to        send out last_flag to indicate whether or not the current        coefficient is the last non-zero coefficient. Here, it is not        the last non-zero coefficient, so last_flag=0. Note that the        last_ge2_flag=1 here indicates implicitly that this coefficient        must have an absolute value larger than 1 (i.e., it must be a        ge2), so the Bin_(—)=0 is saved. We send out its absolute value        with level by coding 2-2=0, and then the decoder knows the        absolute value is 0+2=2. Finally, send out its sign “+” with 0.    -   For the next coefficient “0”, sig_flag=0.    -   The next coefficient “1”, it is non-zero (sig_flag=1) and not        the last non-zero coefficient (last_flag=0). After        last_ge2_flag=1, all the significant coefficients must have an        absolute value of one, so we need not code its absolute value        with Bin_(—)1 or level any more. We only send out its sign “+”        with 0.    -   For the next coefficient “0”, sig_flag=0.    -   The next coefficient “−1”, it is non-zero (sig_flag=1) and is        the last non-zero (last_flag=1). After we send out its sign “−”        with 1, the coding of this block is complete.

From the above coding example, we see that at least one novel aspect ofthe described embodiment is the use of the last_ge2_flag. There areseveral advantages of last_ge2_flag, including at least the following:

-   -   1. Last_ge2_flag saves some last_flag. If last_ge2_flag=0, there        must be non-zero (specifically greater than one) coefficients in        the following scanning positions. Then the last_flag must be 0,        so we save these last_flag's until last_ge2_flag=1.    -   Compare coding the same example block with CABAC and the        proposed method. In FIG. 1, coding the block with CABAC requires        5 last_flags, which are 00001, while in FIG. 5, coding the same        block with the new method requires 3 last_ge2_flags (001) and 3        last_flags (001). Presuming N non-zero coefficients in a block,        CABAC requires N last_flags, while the new method requires in        total N+1 last_ge2_flags and last_flags. Compared with the next        two savings by last_ge2_flag, this one extra flag here is quite        worthwhile.    -   2. At the end of the scanning path it is very likely to observe        the occurrence of successive so-called trailing ones, i.e.,        transform coefficient levels with an absolute value equal to        one. For the example in FIG. 5, there are five significant        coefficients: 10, −1, 2, 1, −1, and “1” and “−1” at the end are        trailing ones. Last_ge2_flag saves Bin_(—)1′s for trailing ones        in CABAC. After last_ge2_flag =1, if some coefficients are        indicated to be non-zeros, then they must have an absolute value        of one. They are actually the trailing ones in the CABAC coding.        In CABAC, each such trailing one needs one Bin_(—)1 to indicate        it is one (instead of ge2). Since we indicate them implicitly        with last_ge2_flag=1, the Bin_(—)1's for the trailing ones are        saved here. In large transform blocks, there is a comparatively        large number of trailing ones, so the saving here is        significant.    -   3. Last_ge2_flag saves other Bin_(—)1 for non-trailing ones.        When the last_ge2_flag turns from 0 to 1 at some coefficient,        the coefficient must be a ge2 (i.e., the coefficient has an        absolute value greater than one), so there is no need to send        out the Bin_(—)1, which must be 0. An example is the coefficient        2 of the coding example in FIG. 1.    -   Such a saving in Bin_(—)1 only exists in the block where        last_ge2_flag turns from 0 to 1. That is, there are more than        one last_ge2_flags sent out for the block. Presuming only one        last_ge2_flag is sent out for a block, it must be 1, and the        corresponding coefficient could have an absolute value of one or        ge2. Some example cases are provided in FIG. 6, where the        coefficients are arranged in some given scanning order.

Turning to FIG. 6, exemplary special cases where Bin_(—)1 is not savedare indicated generally by the reference numeral 600. Moreover, we notethat there are four special cases, and each is respectively indicated asCase 1, Case 2, Case 3, and Case 4. In Cases 1 and 2, the absolutevalues of all significant coefficients are smaller than 2. In Cases 3and 4, only the first significant coefficient has an absolute value ofgreater than 1. In all cases, last_ge2_flag is set to 1 at the firstsignificant coefficient, so there is no “turning from 0 to 1” for thelast_ge2_flag and only one bin is used for the last_ge2_flag. Hence, thecoefficient with last_ge2_flag=1 could be 1 (as in Case 1 and Case 2) orgreater than 1 (as in Case 3 and Case 4), which should be indicated byBin_(—)1. In Case 1 and Case 2, the first significant coefficient “1”has last_ge2_flag=1 and Bin_(—)1=1. In Case 3 and Case 4, the firstsignificant coefficient 2 (or more generally greater than or equal to 2)has last_ge2_flag=1 and Bin_(—)1=0. That is, when the last_ge2_flag fora block includes only one bin, which must be 1, the correspondingBin_(—)1 needs to be encoded.

Turning to FIG. 7A, an exemplary method for entropy encoding isindicated generally by the reference numeral 700. The method includes astart block 712 that passes control to a decision block 701. Thedecision block 701 determines whether or not there are significantcoefficients in the block. If so, then control is passed to a functionblock 702. Otherwise, control is passed to an end block 799. Thefunction block 702 sets last_ge2_flag=0 and last_flag=0, and passescontrol to a function block 703. The function block 703 begins a loopusing a variable j having a range from 1 to the number (#) ofcoefficients, if last_flag=0, and passes control to a function block704. The function block 704 encodes sig_flag, and passes control to adecision block 705. The decision block 705 determines whether or notsig_flag=1. If so, then control is passed to a function block 706.Otherwise, control is passed to a loop limit block 711. The functionblock 706 encodes last_ge2_flag if needed, and passes control to afunction block 707. The function block 707 encodes last_flag if needed,and passes control to a function block 708. The function block 708encodes Bin_(—)1 if needed, and passes control to a function block 709.The function block 709 encodes the level if needed, and passes controlto a function block 710. The function block 710 encodes the sign, andpasses control to the loop limit block 711. The loop limit block 711ends the loop, and passes control to an end block 799.

Regarding the function block 703, we loop for the coefficients in theblock in some scanning order. There is no need to loop for thecoefficients after the coefficient with last_flag=1. Regarding thedecision block 705, if sig_flag=1 (significant), then we further codethe coefficient by the blocks 706-710. Otherwise, we loop for the nextcoefficient. Regarding the function block 706, the same deals withlast_ge2_flag, noting that processing of last_ge2_flag is furtherdescribed with respect to FIG. 7B. Regarding the function block 707, thesame deals with last_flag, noting that processing of last_flag isfurther described with respect to FIG. 7C. Regarding the function block708, the same deals with Bin_(—)1, noting that processing of Bin_(—)1 isfurther described with respect to FIG. 7D. Regarding the function block709, the same deals with level, noting that processing of level isfurther described with respect to FIG. 7E.

Turning to FIG. 7B, an exemplary method for encoding last_ge2_flag isindicated generally by the reference numeral 720. The method 720includes a start block 719 that passes control to a decision block 721.The decision block 721 determines whether or not last_ge2_flag=0. If so,then control is passed to a decision block 722. Otherwise, control ispassed to an end block 798. The decision block 722 determines whether ornot there are coefficients greater than 1 after the current coefficient.If so, then control is passed to a function block 723. Otherwise,control is passed to a function block 724. The function block 723 setslast_ge2_flag=0, and passes control to a decision block 725. Thedecision block 724 sets last_ge2_flag=1, and passes control to thedecision block 725. The decision block 725 determines whether or not thecurrent scanning position is the last scanning position. If so, thencontrol is passed to the end block 798. Otherwise, control is passed toa function block 726. The function block 726 encodes last_ge2_flag, andpasses control to the end block 798.

Turning to FIG. 7C, an exemplary method for encoding last_flag isindicated generally by the reference numeral 730. The method includes astart block 729 that passes control to a decision block 731. Thedecision block 731 determines whether or not last_ge2_flag=1. If so,then control is passed to a decision block 732. Otherwise, control ispassed to an end block 797. The decision block 732 determines whether ornot there are significant coefficients after the current coefficient. Ifso, then control is passed to a function block 733. Otherwise, controlis passed to a function block 734. The function block 733 setslast_flag=0, and passes control to a decision block 735. The functionblock 734 sets last_flag=1, and passes control to the decision block735. The decision block 735 determines whether or not the currentscanning position is the last scanning position. If so, then control ispassed to the end block 797. Otherwise, control is passed to a functionblock 736. The function block 736 encodes last_flag, and passes controlto the end block 797.

Turning to FIG. 7D, an exemplary method for encoding Bin_(—)1 isindicated generally by the reference numeral 740. The method 740includes a start block 739 that passes control to a decision block 741.The decision block 741 determines whether or not (last_ge2_flag=0) or(last_ge2_flag=1 for the current coefficient which is the firstsignificant coefficient in the block). If so, then control is passed toa decision block 742. Otherwise, control is passed to an end block 796.The decision block 742 determines whether or not the absolute value ofthe transform coefficient is one (Abs(currCoeff)=1). If so, then controlis passed to a function block 743. Otherwise, control is passed to afunction block 744. The function block 743 sets Bin_(—)1=1, and passescontrol to a function block 745. The function block 744 sets Bin_1=0,and passes control to the function block 745. The function block 745encodes Bin_1, and passes control to an end block 796.

Turning to FIG. 7E, an exemplary method for encoding level is indicatedgenerally by the reference numeral 750. The method 750 includes a startblock 749 that passes control to a decision block 751. The decisionblock 751 determines whether or not the absolute value of the transformcoefficient is greater or equal to 2 (Abs(currCoeff)>=2). If so, thencontrol is passed to a function block 752. Otherwise, control is passedto an end block 795. The function block 752 encodes level, wherelevel=abs(currCoeff)−2, and passes control to the end block 795.

The coding order in method 700 is the same as the coding order of theexample in FIG. 5. However, the coding order could be flexible forblocks 706-710 as far as satisfying the following rules:

-   -   Last_ge2_flag (per the function block 706) is processed before        Bin_(—)1 (per function block 708), and Bin_(—)1 (per the        function block 708) is processed before level (per function        block 709). That is 706→708→709.    -   The processing of last_flag (per the function block 707) could        follow function blocks 706, 708, or 709.    -   The processing of sign (per the function block 710) could be        done before or after any of the four function blocks 706, 707,        708, 709.    -   The processing order in the decoder must match that in the        encoder.

Note there is special handling when encoding the coefficient in the lastscanning position in the block.

-   -   In the method 720, if the last_ge2_flag is still 0 before the        last coefficient, then last_ge2_flag must be 1 for the last        coefficient, so last_ge2_flag need not be encoded.    -   In the method 730, similarly, if the last_flag is still 0 before        the last coefficient, then last_flag must be 1 for the last        coefficient, so last_flag need not be encoded.    -   Bin_(—)1 (740): Regarding the function block 741, if the        last_ge2_flag is set to 1 by the function block 724 for the last        coefficient (even though it needs not be encoded and sent out by        the function block 726) and it is the first significant        coefficient in the block, then Bin_(—)1 should be tested and        encoded as per blocks 742-745.    -   Level information (as per the function block 709) should be        encoded if needed.

Turning to FIG. 8A, an exemplary method for entropy decoding isindicated generally by the reference numeral 800. The method 800includes a start block 819 that passes control to a decision block 801.The decision block 801 determines whether or not there are significantcoefficients in the block. If so, then control is passed to a functionblock 802. Otherwise, control is passed to an end block 899. Thefunction block 802 sets last_ge2_flag=0 and last_flag=0, and passescontrol to a function block 803. The function block 803 begins a loopusing a variable j having a range from 1 to the number (#) ofcoefficients if last_flag=0, and passes control to a function block 804.The function block 804 decodes sig_flag, and passes control to adecision block 805. The decision block 805 determines whether or notsig_flag=1. If so, then control is passed to a function block 806.Otherwise, control is passed to a loop limit block 811. The functionblock 806 decodes last_ge2_flag if needed, and passes control to afunction block 807. The function block 807 decodes last_flag if needed,and passes control to a function block 808. The function block 808decodes Bin_(—)1 if needed, and passes control to a function block 809.The function block 809 decodes level if needed, and passes control to afunction block 810. The function block 810 decodes the sign, and passescontrol to the loop limit block 811. The function block 811 ends theloop, and passes control to the end block 899.

Regarding the function block 803, we loop for the coefficients in theblock in the same scanning order as the encoder. There is no need toloop for the coefficients after the coefficient with last_flag=1.Regarding the function block 806, the same deals with last_ge2_flag,noting that processing of last_ge2_flag is further described withrespect to FIG. 8B. Regarding the function block 807, the same dealswith last_flag, noting that processing of last_flag is further describedwith respect to FIG. 8C. Regarding the function block 808, the samedeals with Bin_(—)1, noting that processing of Bin_(—)1 is furtherdescribed with respect to FIG. 8D. Regarding the function block 809, thesame deals with level, noting that processing of level is furtherdescribed with respect to FIG. 8E.

It is to be appreciated that in one embodiment, the decoding order ofmethod 800 matches the encoding order of method 700. However, thedecoding order could be flexible for function blocks 806-810 as far asmatching the encoding order with respect thereto.

Turning to FIG. 8B, an exemplary method for decoding last_ge2_flag isindicated generally by the reference numeral 820. The method 820includes a start block 812 that passes control to a decision block 821.The decision block 821 determines whether or not last_ge2_flag=0. If so,then control is passed to a decision block 822. Otherwise, control ispassed to an end block 898. The decision block 822 determines whether ornot the current scanning position is the last scanning position. If so,then control is passed to block 823. Otherwise, control is passed to afunction block 824. The function block 723 sets last_ge2_flag=1, andpasses control to the end block 898. The function block 824 decodeslast_ge2_flag, and passes control to the end block 898.

Turning to FIG. 8C, an exemplary method for decoding last_flag isindicated generally by the reference numeral 830. The method 830includes a start block 825 that passes control to a decision block 831.The decision block 831 determines whether or not last_ge2_flag=1. If so,then control is passed to a decision block 832. Otherwise, control ispassed to an end block 897. The decision block 832 determines whether ornot the current scanning position is the last scanning position. If so,then control is passed to the end block 897. Otherwise, control ispassed to a function block 833. The function block 833 decodeslast_flag, and passes control to the end block 897.

Turning to FIG. 8D, an exemplary method for decoding Bin_(—)1 isindicated generally by the reference numeral 840. The method 840includes a start block 834 that passes control to a function block 841.The function block 841 sets Bin_(—=)1, and passes control to a decisionblock 842. The decision block 842 determines whether or not(last_ge2_flag=0) or (last_ge2_flag=1 for the current coefficient whichis the first significant coefficient in the block). If so, then controlis passed to a function block 843. Otherwise, control is passed to anend block 896. The function block 843 decodes Bin_(—)1, and passescontrol to an end block 896. Turning to FIG. 8E, an exemplary method fordecoding level is indicated generally by the reference numeral 850. Themethod 850 includes a start block 844 that passes control to a decisionblock 851. The decision block 851 determines whether or not (Bin_(—)1=0)or (last_ge2_flag=1 for the current coefficient which is not the firstsignificant coefficient in the block). If so, then control is passed toa function block 852. Otherwise, control is passed to a function block853. The function block 852 decodes level, and sets the absolute valueof the current coefficient to level+2 (Abs(currCoeff)=level+2), andpasses control to an end block 895. The function block 853 sets theabsolute value of the current coefficient to 1 (abs(currCoeff))=1, andpasses control to the end block 895.

Note there is special handling when decoding the coefficient in the lastscanning position in the block.

-   -   In the method 820, if the last_ge2_flag is still 0 before the        last coefficient, then last_ge2_flag must be 1 for the last        coefficient, so last_ge2_flag need not be decoded. Instead, it        is just set to 1 as per the function block 823.    -   In the method 830, similarly, if the last_flag is still 0 before        the last coefficient, then last_flag must be 1 for the last        coefficient, so last_flag need not be decoded.    -   Bin_(—)1 (per the method 840): Regarding the function block 842,        if the last_ge2_flag is set to 1 for the last coefficient in 823        (even though it needs not be decoded by the function block 824)        and it is the first significant coefficient in the block, then        Bin_(—)1 should be decoded by the function block 843.    -   Level (per the method 850): In 851, if Bin_(—)1=0 or if        last_ge2_flag is set to 1 for the last coefficient by the        function block 823 (even though it needs not be decoded by the        function block 824) and the last coefficient is not the first        significant coefficient, then level should be decoded by the        function block 852. Otherwise, set the absolute value of this        last coefficient to be 1 by the function block 853.

Another advantage of the proposed method is the coding of thecoefficient level in the same scanning pass of the other syntaxes, suchas the sig_flag, last_flag, and so forth. In CABAC, the coefficientlevel information is coded in the inverse zigzag scanning order, whichcan be seen as a second pass to code a block. In this inverse zigzagorder coding, the level information can be coded with the context modelsdesigned with the inverse zigzag position of the coded coefficients. Tobe concrete, the first coded coefficient (in an inverse zigzag order) iscoded with context model 0, the second coded coefficient is coded withcontext model 1, and so forth. This context model design shows somegains compared to the coding of the level bins with equal probable(0.5/0.5) models (i.e., output the bins directly with 1 bit per bin).

This small penalty can be easily compensated with the properly designedcontext models in the one pass coding method. Given the coefficientlevel information of the coded coefficients, the context models for thesig_flag, last_ge2_flag, last_flag, Bin_(—)1, and the level bins can bedesigned based on the known level information from their coded neighborsto further improve the performance of the context models and achievehigher coding efficiency.

Turning to FIG. 9, a method for selecting and signaling a value for acurrent transform coefficient is indicated generally by the referencenumeral 900. The method 900 includes a start block 905 that passescontrol to a function block 910. The function block 910 inputs picturesand a set of values, and passes control to a function block 920. Thefunction block 920 adaptively selects a value based on statistics ofpreviously processed blocks or pictures, and passes control to afunction block 930. The function block 930 signals the selected valueexplicitly at a sequence level, a frame level, a slice level, or a blocklevel, and passes control to an end block 999.

Turning to FIG. 10, an exemplary method for decoding a value for acurrent transform coefficient is indicated generally by the referencenumeral 1000. The method 1000 includes a start block 1005 that passescontrol to a function block 1010. The function block 1010 decodes thevalue at a sequence level, a frame level, a slice level, or a blocklevel, and passes control to an end block 1099.

Thus, the present principles advantageously provide methods andapparatus for improved entropy encoding and decoding that systematicallycodes a quantized transform block. There are at least two noveltiesassociated with this approach. First, the introduced last_ge2_flagreduces the binary bins to be binary arithmetic coded in the encoder anddecoder and, thus, a simpler system is achieved. Second, coding of thecoefficient value information in the same scanning order with the othersyntaxes makes entropy coding of a block finished in one scanning pass.The value information can be used to improve the context models of thesyntaxes to further achieve higher coding efficiency.

It is to be appreciated that last_ge2_flag is just an embodiment. As isreadily apparent to one of ordinary skill in this and related arts, theflag can alternatively be referred to as last_geX_flag, where X is anynumber.

A description will now be given of some of the many attendantadvantages/features of the present invention, some of which have beenmentioned above. For example, one advantage/feature is an apparatushaving a video encoder for encoding at least a block in a picture bytransforming a residue of the block to obtain transform coefficients,quantizing the transform coefficients to obtain quantized transformcoefficients, and entropy coding the quantized transform coefficients.The quantized transform coefficients are encoded in a single pass usinga flag to indicate that a current one of the quantized transformcoefficients being processed is a last non-zero coefficient for theblock having a value greater than or equal to a specified value.

Another advantage/feature is the apparatus having the video encoder asdescribed above, wherein the specified value is 2.

Yet another advantage/feature is the apparatus having the video encoderas described above, wherein subsequent non-zero coefficients from amongthe quantized transform coefficients having a value less than thespecified value are encoded by encoding only the respective signs of thesubsequent non-zero coefficients having the value less than thespecified value.

Still another advantage/feature is the apparatus having the videoencoder as described above, wherein the specified value is selected fromamong a plurality of values.

Moreover, another advantage/feature is the apparatus having the videoencoder wherein the specified value is selected from among a pluralityof values as described above, wherein the picture is one of a pluralityof pictures included in a video sequence, and the specified value isadaptively selected responsive to derived statistics from previouslyprocessed blocks in the picture or in one or more other pictures fromamong the plurality of pictures in the video sequence.

Further, another advantage/feature is the apparatus having the videoencoder as described above, wherein the specified value is explicitlysignaled.

Also, another advantage/feature is the apparatus having the videoencoder as described above, wherein the specified value is explicitlysignaled at at least one of a sequence level, a frame level, a slicelevel, and a block level.

Additionally, another advantage/feature is the apparatus having thevideo encoder as described above, wherein a level of the current one ofthe quantized transform coefficients is encoded by subtracting thespecified value from an actual value of the current one of the quantizedtransform coefficients to obtain a difference value and encoding thedifference value as the level, in order to reproduce the level at acorresponding decoder by adding the difference value to the specifiedvalue.

Moreover, another advantage/feature is the apparatus having the videoencoder as described above, wherein at least a sig_flag syntax element,the flag, a last_flag syntax element, a Bin_(—)1 syntax element, a levelsyntax element, and a sign syntax element are encoded in a same scanningorder, the sig_flag syntax element for indicating whether the currentone of the quantized transform coefficients has a non-zero value, thelast_flag for indicating whether the current one of the quantizedtransform coefficients having the non-zero value is a last quantizedtransform coefficient having the non-zero value in the block in a givenscanning order, the Bin_(—)1 syntax element for indicating that anabsolute value of the current one of the quantized transformcoefficients has a currently unknown non-zero value, the level syntaxelement for indicating an absolute value of the current one of thequantized transform coefficients when the current one of the quantizedtransform coefficients has the absolute value greater than the specifiedvalue, and the sign syntax element for indicating a corresponding signof the current one of the quantized transform coefficients.

These and other features and advantages of the present principles may bereadily ascertained by one of ordinary skill in the pertinent art basedon the teachings herein. It is to be understood that the teachings ofthe present principles may be implemented in various forms of hardware,software, firmware, special purpose processors, or combinations thereof.

Most preferably, the teachings of the present principles are implementedas a combination of hardware and software. Moreover, the software may beimplemented as an application program tangibly embodied on a programstorage unit. The application program may be uploaded to, and executedby, a machine comprising any suitable architecture. Preferably, themachine is implemented on a computer platform having hardware such asone or more central processing units (“CPU”), a random access memory(“RAM”), and input/output (“I/O”) interfaces. The computer platform mayalso include an operating system and microinstruction code. The variousprocesses and functions described herein may be either part of themicroinstruction code or part of the application program, or anycombination thereof, which may be executed by a CPU. In addition,various other peripheral units may be connected to the computer platformsuch as an additional data storage unit and a printing unit.

It is to be further understood that, because some of the constituentsystem components and methods depicted in the accompanying drawings arepreferably implemented in software, the actual connections between thesystem components or the process function blocks may differ dependingupon the manner in which the present principles are programmed. Giventhe teachings herein, one of ordinary skill in the pertinent art will beable to contemplate these and similar implementations or configurationsof the present principles.

Although the illustrative embodiments have been described herein withreference to the accompanying drawings, it is to be understood that thepresent principles is not limited to those precise embodiments, and thatvarious changes and modifications may be effected therein by one ofordinary skill in the pertinent art without departing from the scope orspirit of the present principles. All such changes and modifications areintended to be included within the scope of the present principles asset forth in the appended claims.

1. An apparatus, comprising: a video encoder for encoding at least ablock in a picture by transforming a residue of the block to obtaintransform coefficients, quantizing the transform coefficients to obtainquantized transform coefficients, and entropy coding the quantizedtransform coefficients, wherein the quantized transform coefficients areencoded using a flag to indicate that a current one of the quantizedtransform coefficients being processed is a last non-zero coefficientfor the block having a value greater than or equal to a specified value.2. The apparatus of claim 1, wherein the specified value is
 2. 3. Theapparatus of claim 1, wherein subsequent non-zero coefficients fromamong the quantized transform coefficients having a value less than thespecified value are encoded by encoding only the respective signs of thesubsequent non-zero coefficients having the value less than thespecified value.
 4. The apparatus of claim 1, wherein the specifiedvalue is selected from among a plurality of values.
 5. The apparatus ofclaim 4, wherein the picture is one of a plurality of pictures comprisedin a video sequence, and the specified value is adaptively selectedresponsive to derived statistics from previously processed blocks in thepicture or in one or more other pictures from among the plurality ofpictures in the video sequence.
 6. The apparatus of claim 1, wherein thespecified value is explicitly signaled.
 7. The apparatus of claim 1,wherein the specified value is explicitly signaled at at least one of asequence level, a frame level, a slice level, and a block level.
 8. Theapparatus of claim 1, wherein a level of the current one of thequantized transform coefficients is encoded by subtracting the specifiedvalue from an actual value of the current one of the quantized transformcoefficients to obtain a difference value and encoding the differencevalue as the level, in order to reproduce the level at a correspondingdecoder by adding the difference value to the specified value.
 9. Theapparatus of claim 1, wherein at least a sig_flag syntax element, theflag, a last_flag syntax element, a Bin_(—)1 syntax element, a levelsyntax element, and a sign syntax element are encoded in a same scanningorder, the sig_flag syntax element for indicating whether the currentone of the quantized transform coefficients has a non-zero value, thelast_flag for indicating whether the current one of the quantizedtransform coefficients having the non-zero value is a last quantizedtransform coefficient having the non-zero value in the block in a givenscanning order, the Bin_(—)1 syntax element for indicating that anabsolute value of the current one of the quantized transformcoefficients has a currently unknown non-zero value, the level syntaxelement for indicating an absolute value of the current one of thequantized transform coefficients when the current one of the quantizedtransform coefficients has the absolute value greater than the specifiedvalue, and the sign syntax element for indicating a corresponding signof the current one of the quantized transform coefficients.
 10. In avideo encoder, a method, comprising: encoding at least a block in apicture by transforming a residue of the block to obtain transformcoefficients, quantizing the transform coefficients to obtain quantizedtransform coefficients, and entropy coding the quantized transformcoefficients, wherein the quantized transform coefficients are encodedusing a flag to indicate that a current one of the quantized transformcoefficients being processed is a last non-zero coefficient for theblock having a value greater than or equal to a specified value.
 11. Themethod of claim 10, wherein the specified value is
 2. 12. The method ofclaim 10, wherein subsequent non-zero coefficients from among thequantized transform coefficients having a value less than the specifiedvalue are encoded by encoding only the respective signs of thesubsequent non-zero coefficients having the value less than thespecified value.
 13. The method of claim 10, wherein the specified valueis selected from among a plurality of values.
 14. The method of claim13, wherein the picture is one of a plurality of pictures comprised in avideo sequence, and the specified value is adaptively selectedresponsive to derived statistics from previously processed blocks in thepicture or in one or more other pictures from among the plurality ofpictures in the video sequence.
 15. The method of claim 10, wherein thespecified value is explicitly signaled.
 16. The method of claim 10,wherein the specified value is explicitly signaled at at least one of asequence level, a frame level, a slice level, and a block level.
 17. Themethod of claim 10, wherein a level of the current one of the quantizedtransform coefficients is encoded by subtracting the specified valuefrom an actual value of the current one of the quantized transformcoefficients to obtain a difference value and encoding the differencevalue as the level, in order to reproduce the level at a correspondingdecoder by adding the difference value to the specified value.
 18. Themethod of claim 10, wherein at least a sig_flag syntax element, theflag, a last_flag syntax element, a Bin_(—)1 syntax element, a levelsyntax element, and a sign syntax element are encoded in a same scanningorder, the sig_flag syntax element for indicating whether the currentone of the quantized transform coefficients has a non-zero value, thelast_flag for indicating whether the current one of the quantizedtransform coefficients having the non-zero value is a last quantizedtransform coefficient having the non-zero value in the block in a givenscanning order, the Bin_(—)1 syntax element for indicating that anabsolute value of the current one of the quantized transformcoefficients has a currently unknown non-zero value, the level syntaxelement for indicating an absolute value of the current one of thequantized transform coefficients when the current one of the quantizedtransform coefficients has the absolute value greater than the specifiedvalue, and the sign syntax element for indicating a corresponding signof the current one of the quantized transform coefficients.
 19. Anapparatus, comprising: a video decoder for decoding at least a block ina picture by entropy decoding quantized transform coefficients,de-quantizing the quantized transform coefficients to obtain transformcoefficients, and inverse transforming the transform coefficients toobtain a reconstructed residue of the block for use in reconstructingthe block, wherein the quantized transform coefficients are decodedusing a flag to indicate that a current one of the quantized transformcoefficients being processed is a last non-zero coefficient for theblock having a value greater than or equal to a specified value.
 20. Theapparatus of claim 19, wherein the specified value is
 2. 21. Theapparatus of claim 19, wherein subsequent non-zero coefficients fromamong the quantized transform coefficients having a value less than thespecified value are decoded by decoding only the respective signs of thesubsequent non-zero coefficients having the value less than thespecified value.
 22. The apparatus of claim 19, wherein the specifiedvalue is explicitly determined.
 23. The apparatus of claim 19, whereinthe specified value is explicitly determined from at least one of asequence level, a frame level, a slice level, and a block level.
 24. Theapparatus of claim 19, wherein a level of the current one of thequantized transform coefficients is decoded by decoding a differencevalue previously determined between an actual value of the current oneof the quantized transform coefficients and the specified value, andadding the difference value to the specified value to obtain the level.25. The apparatus of claim 19, wherein at least a sig_flag syntaxelement, the flag, a last_flag syntax element, a Bin_(—)1 syntaxelement, a level syntax element, and a sign syntax element are encodedin a same scanning order, the sig_flag syntax element for indicatingwhether the current one of the quantized transform coefficients has anon-zero value, the last_flag for indicating whether the current one ofthe quantized transform coefficients having the non-zero value is a lastquantized transform coefficient having the non-zero value in the blockin a given scanning order, the Bin_(—)1 syntax element for indicatingthat an absolute value of the current one of the quantized transformcoefficients has a currently unknown non-zero value, the level syntaxelement for indicating an absolute value of the current one of thequantized transform coefficients when the current one of the quantizedtransform coefficients has the absolute value greater than the specifiedvalue, and the sign syntax element for indicating a corresponding signof the current one of the quantized transform coefficients.
 26. In avideo decoder, a method, comprising: decoding at least a block in apicture by entropy decoding quantized transform coefficients,de-quantizing the quantized transform coefficients to obtain transformcoefficients, and inverse transforming the transform coefficients toobtain a reconstructed residue of the block for use in reconstructingthe block, wherein the quantized transform coefficients are decodedusing a flag to indicate that a current one of the quantized transformcoefficients being processed is a last non-zero coefficient for theblock having a value greater than or equal to a specified value.
 27. Themethod of claim 26, wherein the specified value is
 2. 28. The method ofclaim 26, wherein subsequent non-zero coefficients from among thequantized transform coefficients having a value less than the specifiedvalue are decoded by decoding only the respective signs of thesubsequent non-zero coefficients having the value less than thespecified value.
 29. The method of claim 26, wherein the specified valueis explicitly determined.
 30. The method of claim 26, wherein thespecified value is explicitly determined from at least one of a sequencelevel, a frame level, a slice level, and a block level.
 31. The methodof claim 26, wherein a level of the current one of the quantizedtransform coefficients is decoded by decoding a difference valuepreviously determined between an actual value of the current one of thequantized transform coefficients and the specified value, and adding thedifference value to the specified value to obtain the level.
 32. Themethod of claim 26, wherein at least a sig_flag syntax element, theflag, a last_flag syntax element, a Bin_(—)1 syntax element, a levelsyntax element, and a sign syntax element are encoded in a same scanningorder, the sig_flag syntax element for indicating whether the currentone of the quantized transform coefficients has a non-zero value, thelast_flag for indicating whether the current one of the quantizedtransform coefficients having the non-zero value is a last quantizedtransform coefficient having the non-zero value in the block in a givenscanning order, the Bin_(—)1 syntax element for indicating that anabsolute value of the current one of the quantized transformcoefficients has a currently unknown non-zero value, the level syntaxelement for indicating an absolute value of the current one of thequantized transform coefficients when the current one of the quantizedtransform coefficients has the absolute value greater than the specifiedvalue, and the sign syntax element for indicating a corresponding signof the current one of the quantized transform coefficients.
 33. Acomputer readable storage media having video signal data encodedthereupon, comprising: at least a block in a picture encoded bytransforming a residue of the block to obtain transform coefficients,quantizing the transform coefficients to obtain quantized transformcoefficients, and entropy coding the quantized transform coefficients,wherein the quantized transform coefficients are encoded using a flag toindicate that a current one of the quantized transform coefficientsbeing processed is a last non-zero coefficient for the block having avalue greater than or equal to a specified value.